A note on an alternating upper bound for random walks on semigroups
نویسندگان
چکیده
We consider random walks on idempotent semigroups, called Left Regular Bands, satisfying the relation xyx = xy for any two elements x and y of the semigroup. We give an alternating upper bound for the total variation distance of a random walk on a Left Regular Band semigroup, improving the previous bound by Brown and Diaconis.
منابع مشابه
Möbius Functions and Semigroup Representation Theory Ii: Character Formulas and Multiplicities
We generalize the character formulas for multiplicities of irreducible constituents from group theory to semigroup theory using Rota’s theory of Möbius inversion. The technique works for a large class of semigroups including: inverse semigroups, semigroups with commuting idempotents, idempotent semigroups and semigroups with basic algebras. Using these tools we are able to give a complete descr...
متن کاملRefined estimates for some basic random walks on the symmetric and alternating groups
We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups Sn and An. We consider the following models: random transposition, transpose top with random, random insertion, and walks generated by the uniform measure on a conjugacy class. In the case of random walks on Sn and An generated by the uniform measure on...
متن کاملSemigroups , Rings , and Markov
We analyze random walks on a class of semigroups called \left-regular bands". These walks include the hyperplane chamber walks of Bidi-gare, Hanlon, and Rockmore. Using methods of ring theory, we show that the transition matrices are diagonalizable and we calculate the eigenvalues and multiplicities. The methods lead to explicit formulas for the projections onto the eigenspaces. As examples of ...
متن کاملMeeting Times of Random Walks on Graphs
We prove an upper bound on the meeting time of an arbitrary number of random walks in any connected undirected graph in terms of the meeting times of fewer random walks. We show that the bound is tight for rings, and that it is both stronger and more general than a bound suggested by Tetali and Winkler [4].
متن کاملThe Cover Time of Deterministic Random Walks for General Transition Probabilities
Abstract. The deterministic random walk is a deterministic process analogous to a random walk. While there are some results on the cover time of the rotor-router model, which is a deterministic random walk corresponding to a simple random walk, nothing is known about the cover time of deterministic random walks emulating general transition probabilities. This paper is concerned with the SRT-rou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 176 شماره
صفحات -
تاریخ انتشار 2014